منابع مشابه
Discrete Dynamic Programming
We consider a decision problem taking place over time. In each time period, the single player can take an action by α ∈ A , an action space. All information relevant to the future is incorporated in a state variable y Y ∈ , the state space. The dynamics of y are determined by a transition probability π α ( ’ , ) y y . We define the set of states reachable with some probability under some circum...
متن کاملMarkov Decision Processes: Discrete Stochastic Dynamic Programming
The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover...
متن کاملParametric Dynamic Programming for Discrete Event Systems
This paper describes an approach based on formal calculus to optimize trajectories described by a succession of discrete states, by means of combining the Dynamic Programming technique with the formal approach presented in [Cardillo et 2001]. This approach allows to obtain an explicit form of the optimal control sequence, based on formal calculus. It also allows to introduce parameters in the s...
متن کاملDynamic Programming for Fractional Discrete-Time Systems
Abstract: Dynamic programming problem for fractional discrete-time systems with quadratic performance index has been formulated and solved. A new method for numerical computation of optimal dynamic programming problem has been presented. The efficiency of the method has been demonstrated on numerical example and illustrated by graphs. Graphs also show the differences between the fractional and ...
متن کاملNonserial dynamic programming and local decomposition algorithms in discrete programming
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1962
ISSN: 0003-4851
DOI: 10.1214/aoms/1177704593